Sequential Cover Rule Induction with PA3
نویسندگان
چکیده
Algorithms for induction of concept descriptions from examples are important tools in the fields of machine learning and knowledge discovery in databases. This paper presents an induction algorithm, named PA3, that learns a set of ordered rules from examples. Functionally inspired in AQ and CN2, this algorithm attempts to generalize the learned rules during the induction process and introduces features that allow tuning of several important parameters. This paper describes PA3 and presents a comparison between this algorithm and CN2 on six data sets (three in the domain of stock market and three in an artificial domain).
منابع مشابه
Direct Domain Knowledge Inclusion in the PA3 Rule Induction Algorithm
Inclusion of domain knowledge in a process of knowledge discovery in databases is a complex but very important part of successful knowledge discovery solutions. In real-life data mining development, non-structured domain knowledge involvement in the data preparation phase and in the final interpretation/evaluation phase tends to dominate. This paper presents an experiment of direct domain knowl...
متن کاملDiscovering New Rule Induction Algorithms with Grammar-based Genetic Programming
Rule induction is a data mining technique used to extract classification rules of the form IF (conditions) THEN (predicted class) from data. The majority of the rule induction algorithms found in the literature follow the sequential covering strategy, which essentially induces one rule at a time until (almost) all the training data is covered by the induced rule set. This strategy describes a b...
متن کاملA Dynamic Level-k Model in Sequential Games
Backward induction is a widely accepted principle for predicting behavior in sequential games. In the classic example of the so-called “centipede game”, however, players frequently violate this principle. An alternative is a “dynamic level-k” model, where players choose a rule from a rule hierarchy. The rule hierarchy is iteratively defined such that the level-k rule is a best-response to the l...
متن کاملA Dynamic Level-k Model in Sequential Games
Backward induction is a widely accepted principle for predicting behavior in sequential games. In the classic example of the “centipede game,” however, players frequently violate this principle. An alternative is a “dynamic level-k” model, where players choose a rule from a rule hierarchy. The rule hierarchy is iteratively defined such that the level-k rule is a best response to the level-(k-1)...
متن کاملSelf-Learning Based Land-Cover Classification Using Sequential Class Patterns from Past Land-Cover Maps
To improve the accuracy of classification with a small amount of training data, this paper presents a self-learning approach that defines class labels from sequential patterns using a series of past land-cover maps. By stacking past land-cover maps, unique sequence rule information from sequential change patterns of land-covers is first generated, and a rule-based class label image is then prep...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005